翻訳と辞書
Words near each other
・ Descending branch of lateral circumflex femoral artery
・ Descending branch of occipital artery
・ Descending colon
・ Descending genicular artery
・ Descending limb of loop of Henle
・ Descending palatine artery
・ Descending perineum syndrome
・ Descending tetrachord
・ Descendre
・ Descensus
・ Descent
・ Descent (2005 film)
・ Descent (2007 film)
・ Descent (aeronautics)
・ Descent (magazine)
Descent (mathematics)
・ Descent (song)
・ Descent (The Outer Limits)
・ Descent (video game)
・ Descent 3
・ Descent algebra
・ Descent along torsors
・ Descent Cliff
・ Descent direction
・ Descent from antiquity
・ Descent from Genghis Khan
・ Descent from Mount Sinai (Sistine Chapel)
・ Descent from the Cross
・ Descent Glacier
・ Descent II


Dictionary Lists
翻訳と辞書 辞書検索 [ 開発暫定版 ]
スポンサード リンク

Descent (mathematics) : ウィキペディア英語版
Descent (mathematics)

In mathematics, the idea of descent extends the intuitive idea of 'gluing' in topology. Since the topologists' glue is actually the use of equivalence relations on topological spaces, the theory starts with some ideas on identification.

==Descent of vector bundles==

The case of the construction of vector bundles from data on a disjoint union of topological spaces is a straightforward place to start.
Suppose ''X'' is a topological space covered by open sets ''Xi''. Let ''Y'' be the disjoint union of the ''Xi'', so that there is a natural mapping
:p: Y \rightarrow X.
We think of ''Y'' as 'above' ''X'', with the ''Xi'' projection 'down' onto ''X''. With this language, ''descent'' implies a vector bundle on ''Y ''(so, a bundle given on each ''Xi''), and our concern is to 'glue' those bundles ''Vi'', to make a single bundle ''V'' on X. What we mean is that ''V'' should, when restricted to ''Xi'', give back ''Vi'', up to a bundle isomorphism.
The data needed is then this: on each overlap
:X_,
intersection of ''X''''i'' and ''X''''j'', we'll require mappings
:f_: V_i \rightarrow V_j
to use to identify ''Vi'' and ''Vj'' there, fiber by fiber. Further the ''fij'' must satisfy conditions based on the reflexive, symmetric and transitive properties of an equivalence relation (gluing conditions). For example the composition
:f_ \circ f_ = f_
for transitivity (and choosing apt notation). The ''f''''ii'' should be identity maps and hence symmetry becomes f_=f^_ (so that it is fiberwise an isomorphism).
These are indeed standard conditions in fiber bundle theory (see transition map). One important application to note is ''change of fiber'': if the ''f''''ij'' are all you need to make a bundle, then there are many ways to make an associated bundle. That is, we can take essentially same ''f''''ij'', acting on various fibers.
Another major point is the relation with the chain rule: the discussion of the way there of constructing tensor fields can be summed up as 'once you learn to descend the tangent bundle, for which transitivity is the Jacobian chain rule, the rest is just 'naturality of tensor constructions'.
To move closer towards the abstract theory we need to interpret the disjoint union of the
:X_
now as
:Y \times_X Y,
the fiber product (here an equalizer) of two copies of the projection p. The bundles on the ''X''''ij'' that we must control are actually ''V''′ and ''V''", the pullbacks to the fiber of ''V'' via the two different projection maps to ''X''.
Therefore by going to a more abstract level one can eliminate the combinatorial side (that is, leave out the indices) and get something that makes sense for ''p'' not of the special form of covering with which we began. This then allows a category theory approach: what remains to do is to re-express the gluing conditions.

抄文引用元・出典: フリー百科事典『 ウィキペディア(Wikipedia)
ウィキペディアで「Descent (mathematics)」の詳細全文を読む



スポンサード リンク
翻訳と辞書 : 翻訳のためのインターネットリソース

Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.